منابع مشابه
Complexity bounds for zero-test algorithms
In this paper, we analyze the complexity of a zero test for expressions built from formal power series solutions of first order differential equations with non degenerate initial conditions. We will prove a doubly exponential complexity bound. This bound establishes a power series analogue for “witness conjectures”.
متن کاملLower complexity bounds for interpolation algorithms
We introduce and discuss a new computational model for Hermite–Lagrange interpolation by nonlinear classes of polynomial interpolants. We distinguish between an interpolation problem and an algorithm that solves it. Our model includes also coalescence phenomena and captures a large variety of known Lagrange-Hermite interpolation problems and algorithms. Like in traditional Hermite–Lagrange inte...
متن کاملNew Complexity Bounds for Certain Real Fewnomial Zero Sets
Consider real bivariate polynomials f and g, respectively having 3 and m monomial terms. We prove that for all m≥3, there are systems of the form (f, g) having exactly 2m− 1 roots in the positive quadrant. Even examples with m=4 having 7 positive roots were unknown before this paper, so we detail an explicit example of this form. We also present an O(n) upper bound for the number of diffeotopy ...
متن کاملBounds for Small-Error and Zero-Error Quantum Algorithms
We present a number of results related to quantum algorithms with small error probability and quantum algorithms that are zero-error. First, we give a tight analysis of the trade-offs between the number of queries of quantum search algorithms, their error probability, the size of the search space, and the number of solutions in this space. Using this, we deduce new lower and upper bounds for qu...
متن کاملConnecting SAT Algorithms and Complexity Lower Bounds
I will describe prior and current work on connecting the art of finding good satisfiability algorithms with the art of proving complexity lower bounds: proofs of limitations on what problems can be solved by good algorithms. Surprisingly, even minor algorithmic progress on solving the circuit satisfiability problem faster than exhaustive search can be applied to prove strong circuit complexity ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2006
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2006.06.001